Specifying Transaction Control to Serialize Concurrent Program Executions
نویسندگان
چکیده
We define a programming language independent transaction controller and an operator which when applied to concurrent programs with shared locations turns their behavior with respect to some abstract termination criterion into a transactional behavior. We prove the correctness property that concurrent runs under the transaction controller are serialisable. We specify the transaction controller TaCtl and the operator TA in terms of Abstract State Machines. This makes TaCtl applicable to a wide range of programs and in particular provides the possibility to use it as a plug-in when specifying concurrent system components in terms of Abstract State Machines.
منابع مشابه
Correctness of Parallel Executions in Multidatabase Systems Ruled by Strict 2 Phase Locking
This paper addresses the problem of transaction management in multidatabase systems where the participating local DBMSs serialize transactions by 2 Phase-Locking (2PL) and synchronize their commit actions through a 2 Phase-Commit protocol (2PC). These DBMSs represent the majority of commercial relational and objectoriented DBMSs. We demonstrate that if local DBMSs support strict 2PL optimizatio...
متن کاملSplit-Transactions for Open-Ended Activities
Open-ended activities such as CAD/CAM, VLSI layout and software development require consistent concurrent access and fault tolerance associated with database transactions, but their uncertain duration, uncertain developments during execution and long interactions with other concurrent activities break traditional transaction atomicity boundaries. We propose splittransaction as a new database op...
متن کاملA Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better exploit the parallelism of modern multi-processor machines, such as multi-core microprocessors. We introduce Transactional State Machines (TSMs) as an abstract finite-data model of transactional shared-memory concurre...
متن کاملGranularity of Locks and Degrees of Consistency in a Shared Data Base. in Ifip Working Conference on Modeling of Data Base Management Systems, Pages 1{29, 1975. [gm83] H. Garcia-molina. Using Semantic Knowledge for Transaction Processing in a Distributed Database
Serializability is the traditionally accepted notion of correctness in most database systems. However, in a multidatabase system (MDBS) environment consisting of pre-existing and autonomous database systems, requiring schedules to be serializable could severely hurt performance. Besides, in a number of instances, the semantics of transactions can be exploited in order to permit certain non-seri...
متن کاملSerialisable Multi-Level Transaction Control: A Specification and Verification
We define a programming language independent controller TaCtl for multi-level transactions and an operator TA, which when applied to concurrent programs with multi-level shared locations containing hierarchically structured complex values, turns their behavior with respect to some abstract termination criterion into a transactional behavior. We prove the correctness property that concurrent run...
متن کامل